-
1 divide and conquer sort
сортировка по принципу "разделяй и властвуй" -
2 divide and conquer sort
сортировка по принципу "разделяй и властвуй" (поразрядная сортировка, начинаемая со старшего значащего разряда ключа и заканчиваемая младшим)Большой англо-русский и русско-английский словарь > divide and conquer sort
-
3 divide and conquer sort
сортировка по принципу "разделяй и властвуй"English-Russian electronics dictionary > divide and conquer sort
-
4 divide and conquer sort
сортировка по принципу "разделяй и властвуй"The New English-Russian Dictionary of Radio-electronics > divide and conquer sort
-
5 divide and conquer sort
сортировка по принципу "разделяй и властвуй" (поразрядная сортировка, начинаемая со старшего значащего разряда ключа и заканчиваемая младшим)English-Russian dictionary of computer science and programming > divide and conquer sort
-
6 sort
1) сортировка || сортировать2) класс; категория; тип; группа || классифицировать; относить к (определённому) классу, категории, типу или группе3) упорядочение || упорядочивать4) pl специальные наборные знаки; специальные символы•- sort by extension
- sort by insertion
- sort by name
- sort by selection
- sort by size
- sort by time
- address calculating sort
- address table sort
- alphanumeric sort
- ascending sort
- Batcher's odd-even merge sort
- block sort
- bogo sort
- bubble sort
- cascade sort
- cocktail shaker sort
- collating sort
- comparison counting sort
- depth sort
- descending sort
- dictionary sort
- distributive sort
- divide and conquer sort
- external sort
- file sort
- heap sort
- Hoare sort
- indirect sort
- internal sort
- key sort
- least significant digit radix sort
- manual sort
- merge sort
- most significant digit radix sort
- multipass sort
- Neumann sort
- oscillating sort
- parallel sort
- pointer sort
- polyphase sort
- property sort
- quick sort
- ripple sort
- selection sort
- shaker sort
- Shell sort
- sifting sort
- straight insertion sort
- straight selection sort
- stupid sort
- tag sort
- tape sort
- topological sort
- tree sort
- Williams sort -
7 sort
1) сортировка || сортировать2) класс; категория; тип; группа || классифицировать; относить к (определённому) классу, категории, типу или группе3) упорядочение || упорядочивать4) pl. специальные наборные знаки; специальные символы•- address table sort
- alphanumeric sort
- ascending sort
- Batcher's odd-even merge sort
- block sort
- bogo sort
- bubble sort
- cascade sort
- cocktail shaker sort
- collating sort
- comparison counting sort
- depth sort
- descending sort
- dictionary sort
- distributive sort
- divide and conquer sort
- external sort
- file sort
- heap sort
- Hoare sort
- indirect sort
- internal sort
- key sort
- least significant digit radix sort
- manual sort
- merge sort
- most significant digit radix sort
- multipass sort
- Neumann sort
- oscillating sort
- parallel sort
- pointer sort
- polyphase sort
- property sort
- quick sort
- ripple sort
- selection sort
- shaker sort
- Shell sort
- sifting sort
- sort by exchange
- sort by extension
- sort by insertion
- sort by name
- sort by selection
- sort by size
- sort by time
- straight insertion sort
- straight selection sort
- stupid sort
- tag sort
- tape sort
- topological sort
- tree sort
- Williams sortThe New English-Russian Dictionary of Radio-electronics > sort
-
8 sort
1) сортировка; упорядочение || сортировать; упорядочивать•- sort alphabetically- address calculation sort
- ascending sort
- balanced merge sort
- binary insertion sort
- block sort
- bubble sort
- bucket sort
- card sort
- cascade merge sort
- checkpoint sort
- cocktail shaker sort
- collate sort
- comparison counting sort
- comparison-of-pairs sort
- depth sort
- descending sort
- digital sort
- diminishing increment sort
- disk sort
- distribution counting sort
- divide and conquer sort
- drum sort
- electromechanical sort
- electronic sort
- enumeration sort
- exchange sort
- external sort
- four-tape sort
- generalized sort
- heap sort
- index sort
- insertion sort
- internal sort
- key sort
- machine sort
- manual sort
- max sort
- merge sort
- multipass sort
- multiple sort
- multireel sort
- multiway merge sort
- needle sort
- odd-even transposition sort
- one-tape sort
- oscillation sort
- own coding sort
- partition-exchange sort
- pigeonhole sort
- polyphase sort
- process-limited sort
- property sort
- quick sort
- radix sort
- radix-exchange sort
- random-access sort
- repeated selection sort
- replacement selection sort
- restart sort
- return point sort
- selection sort
- serial sort
- Shell's sort
- sifting sort
- single-pass sort
- sort by counting
- stable sort
- straight insertion sort
- straight selection sort
- tag sort
- tape sort
- tournament sort
- tree-selection sort
- tree-structure sort
- twin drum sort
- two-way insertion sort
- unbalanced merge sort
- Xmas-tree sortEnglish-Russian dictionary of computer science and programming > sort
См. также в других словарях:
Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… … Wikipedia
Merge sort — Example of merge sort sorting a list of random dots. Class Sorting algorithm Data structure Array Worst case performance O(n log n) … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Selection sort — Infobox Algorithm class=Sorting algorithm data=Array time= О(n²) space= О(n) total, O(1) auxiliary optimal=Not usuallySelection sort is a sorting algorithm, specifically an in place comparison sort. It has O( n 2) complexity, making it… … Wikipedia
Algoritmo divide y vencerás — En la cultura popular, divide y vencerás hace referencia a un refrán que implica resolver un problema difícil, dividiéndolo en partes más simples tantas veces como sea necesario, hasta que la resolución de las partes se torna obvia. La solución… … Wikipedia Español
Insertion sort — Infobox Algorithm class=Sorting algorithm data=Array time= О(n²) space= О(n) total, O(1) auxiliary optimal=Not usuallyInsertion sort is a simple sorting algorithm, a comparison sort in which the sorted array (or list) is built one entry at a time … Wikipedia
Merge-Sort — Mergesort ist ein rekursiver, stabiler Sortieralgorithmus, der ähnlich wie Quicksort nach dem Prinzip Teile und herrsche (lat. Divide et impera, engl. Divide and Conquer) arbeitet. Er wurde erstmals 1945 durch John von Neumann vorgestellt. Der… … Deutsch Wikipedia
Merge Sort — Mergesort ist ein rekursiver, stabiler Sortieralgorithmus, der ähnlich wie Quicksort nach dem Prinzip Teile und herrsche (lat. Divide et impera, engl. Divide and Conquer) arbeitet. Er wurde erstmals 1945 durch John von Neumann vorgestellt. Der… … Deutsch Wikipedia
Quick-Sort — Eine zufällige Permutation von Integerwerten wird mit Quicksort sortiert. Die blauen Linien zeigen das Pivotelement im jeweiligen Rekursionsschritt. Quicksort (von engl. quick – schnell, to sort – sortieren) ist ein schneller, rekursiver, nicht… … Deutsch Wikipedia
Quick sort — Eine zufällige Permutation von Integerwerten wird mit Quicksort sortiert. Die blauen Linien zeigen das Pivotelement im jeweiligen Rekursionsschritt. Quicksort (von engl. quick – schnell, to sort – sortieren) ist ein schneller, rekursiver, nicht… … Deutsch Wikipedia
Stooge sort — (auch Trippelsort) ist ein rekursiver Sortieralgorithmus nach dem Prinzip Teile und herrsche (divide and conquer). Inhaltsverzeichnis 1 Prinzip 2 Komplexität 3 Pseudocode 4 Implementierung … Deutsch Wikipedia
